Linear, cyclic and constacyclic codes over S4 = F2 + uF2 + u2F2 + u3F2

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cyclic Codes and Self-Dual Codes Over F2 + uF2

We introduce linear cyclic codes over the ring F 2 + uF 2 = f0; 1; u; u = u + 1g, where u 2 = 0. This ring shares many properties of Z 4 and F 4 and admits a linear "Gray map". Cyclic codes are described as modules over (F 2 + uF 2) n which may not be free. Self-dual codes of odd length exists as in the case of Z 4-codes. We exhibit some extremal codes of this very interesting family.

متن کامل

Cyclic DNA codes over F2+uF2+vF2+uvF2

In this work, we study the structure of cyclic DNA codes of arbitrary lengths over the ring R = F2 + uF2 + vF2 + uvF2 and establish relations to codes over R1 = F2 + uF2 by defining a Gray map between R and R 1 where R1 is the ring with 4 elements. Cyclic codes of arbitrary lengths over R satisfied the reverse constraint and the reverse-complement constraint are studied in this paper. The GC co...

متن کامل

One generator quasi-cyclic codes over F2 + uF2 + vF2 + uvF2

In this paper, we study the structure of 1-generator quasi-cyclic codes over the ring R = F2 +uF2 + vF2 + uvF2, with u2 = v2 = 0 and uv = vu. We determine the minimal spanning sets for these codes. As a generalization of these codes, we also investigate the structure of 1-generator generalized quasi-cyclic codes over R and determine a BCH type bound for them.

متن کامل

Quantum Codes Over F2 + uF2 + vF2

In this paper, it was constructed quantum codes from cyclic codes over finite ring S = F2 + uF2 + vF2, u2 = u, v2 = v, uv = vu = 0 for arbitrary length n. It was given a new Gray map Ψ which is both an isometry and weight preserving map. It was shown that C is self orthogonal codes over S, so is Ψ(C). It was given a necessary and sufficient condition for cyclic codes over S that contains its du...

متن کامل

Cyclic and constacyclic codes over a non-chain ring

In this study, we consider linear and especially cyclic codes over the non-chain ring Zp[v]/〈v − v〉 where p is a prime. This is a generalization of the case p = 3. Further, in this work the structure of constacyclic codes are studied as well. This study takes advantage mainly from a Gray map which preserves the distance between codes over this ring and p-ary codes and moreover this map enlighte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Filomat

سال: 2014

ISSN: 0354-5180,2406-0933

DOI: 10.2298/fil1405897o